Minimum Recombination Histories by Branch and Bound
نویسندگان
چکیده
Recombination plays an important role in creating genetic diversity within species, and inferring past recombination events is central to many problems in genetics. Given a set M of sampled sequences, finding an evolutionary history for M with the minimum number of recombination events is a computationally very challenging problem. In this paper, we present a novel branch and bound algorithm for tackling that problem. Our method is shown to be far more efficient than the only preexisting exact method, described in [1]. Our software implementing the algorithm discussed in this paper is publicly available.
منابع مشابه
Constructing Minimal Ancestral Recombination Graphs
By viewing the ancestral recombination graph as defining a sequence of trees, we show how possible evolutionary histories consistent with given data can be constructed using the minimum number of recombination events. In contrast to previously known methods, which yield only estimated lower bounds, our method of detecting recombination always gives the minimum number of recombination events if ...
متن کاملA Comparison of Phylogenetic Network Methods Using Computer Simulation
BACKGROUND We present a series of simulation studies that explore the relative performance of several phylogenetic network approaches (statistical parsimony, split decomposition, union of maximum parsimony trees, neighbor-net, simulated history recombination upper bound, median-joining, reduced median joining and minimum spanning network) compared to standard tree approaches, (neighbor-joining ...
متن کاملAverage Case Complexity of Branch-and-Bound Algorithms on Random b-ary Trees
Proof. Lets assume that there are two nodes u and v in depth d for which the calculated lower bound is optimal, and u is visited first among all nodes in depth d with optimal lower bound. This implies that the lower bound of v is not smaller than the lower bound of u. A best-first search Branch-and-Bound algorithm only visits nodes with lower bounds not greater than the global minimum. It follo...
متن کاملEfficient computation of close lower and upper bounds on the minimum number of recombinations in biological sequence evolution
MOTIVATION We are interested in studying the evolution of DNA single nucleotide polymorphism sequences which have undergone (meiotic) recombination. For a given set of sequences, computing the minimum number of recombinations needed to explain the sequences (with one mutation per site) is a standard question of interest, but it has been shown to be NP-hard, and previous algorithms that compute ...
متن کاملAn Interval Branch-and-Bound Algorithm for Global Optimization using Pruning Steps
We present a new method for computing verified enclosures for the global minimum value and all global minimum points of univariate functions subject to bound constrains. The method works within the branch and bound framework and incorporates inner and outer pruning steps by using first order information of the objective function by means of an interval evaluation of the derivative over the curr...
متن کامل